Code generation approaches for parallel geometric multigrid solvers
نویسندگان
چکیده
منابع مشابه
Parallel Geometric Multigrid
Multigrid methods are among the fastest numerical algorithms for the solution of large sparse systems of linear equations. While these algorithms exhibit asymptotically optimal computational complexity, their efficient parallelisation is hampered by the poor computation-to-communication ratio on the coarse grids. Our contribution discusses parallelisation techniques for geometric multigrid meth...
متن کامل5 Parallel Geometric Multigrid
Multigrid methods are among the fastest numerical algorithms for the solution of large sparse systems of linear equations. While these algorithms exhibit asymptotically optimal computational complexity, their efficient parallelisation is hampered by the poor computation-to-communication ratio on the coarse grids. Our contribution discusses parallelisation techniques for geometric multigrid meth...
متن کاملParallel Multigrid 3d Maxwell Solvers 1
3D magnetic eld problems are challenging not only because of interesting applications in the industry but also from the mathematical point of view. In the magne-tostatic case, our Maxwell solver is based on a regularized mixed variational formulation of the Maxwell equations in H 0 (curl) H 1 0 (() and their discretization by the N ed elec and Lagrange nite elements. Eliminating the Lagrange mu...
متن کاملParallel geometric multigrid for global weather prediction
The subject of this work is an optimal and scalable parallel geometric multigrid solver for elliptic problems on the sphere. The use of fast elliptic solvers is crucial to the forecasting and data assimilation tools used at the UK Met Office, and the preconditioned Krylov subspace solvers currently used do not perform well for large problem sizes due to the ill-conditioned nature of the problem...
متن کاملHighly Parallel Multigrid Solvers for Multicore and Manycore Processors
In this paper we present an analysis of parallelization properties and implementation details of the new Algebraic multigrid solvers. Variants of smoothers and multicolor grid partitionings are discussed. Optimizations for modern throughput-oriented processors are considered together with different storage schemes. Finally, comparative performance results for multicore and manycore processors a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Analele Universitatii "Ovidius" Constanta - Seria Matematica
سال: 2020
ISSN: 1844-0835
DOI: 10.2478/auom-2020-0038